The Gray Image of Codes over Finite Chain Rings
نویسندگان
چکیده
The results of J. F. Qian et al. [5] on (1 − γ)-constacyclic codes over finite chain rings of nilpotency index 2 are extended to (1 − γe)constacyclic codes over finite chain rings of arbitrary nilpotency index e+1. The Gray map is introduced for this type of rings. We prove that the Gray image of a linear (1− γe)-constacyclic code over a finite chain ring is a distance-invariant quasi-cyclic code over its residue field. When the length of codes and the characteristic of a ring are relatively prime, the Gray images of a linear cyclic code and a linear (1+γe)-constacyclic code are permutatively to quasi-cyclic codes over its residue field. Mathematics Subject Classification: 94B15, 94B60, 94B99
منابع مشابه
Gray Images of Constacyclic Codes over some Polynomial Residue Rings
Let be the quotient ring where is the finite field of size and is a positive integer. A Gray map of length over is a special map from to ( . The Gray map is said to be a ( )-Gray map if the image of any -constacyclic code over is a -constacyclic code over the field . In this paper we investigate the existence of ( )-Gray maps over . In this direction, we find an equivalent ...
متن کاملConstacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملQuantum Codes from Linear Codes over Finite Chain Rings
In this paper, we provide two methods of constructing quantum codes from linear codes over finite chain rings. The first one is derived from the Calderbank-ShorSteane (CSS) construction applied to self-dual codes over finite chain rings. The second construction is derived from the CSS construction applied to Gray images of the linear codes over finite chain ring Fp2m + uFp2m. The good parameter...
متن کاملSimplex and MacDonald Codes over $R_{q}$
In this paper, we introduce the homogeneous weight and homogeneous Gray map over the ring R q = F 2 [u 1 , u 2 ,. .. , u q ]/ u 2 i = 0, u i u j = u j u i for q ≥ 1. We also consider the construction of simplex and MacDonald codes of types α and β over this ring. Further, we study the properties of these codes such as their binary images and covering radius. 1 Introduction Codes over rings have...
متن کاملℤ4-codes and their Gray map images as orthogonal arrays
A classic result of Delsarte connects the strength (as orthogonal array) of a linear code with the minimum weight of its dual: the former is one less than the latter. Since the paper of Hammons et al., there is a lot of interest in codes over rings, especially in codes over Z4 and their (usually non-linear) binary Gray map images. We show that Delsarte’s observation extends to codes over arbitr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0907.3397 شماره
صفحات -
تاریخ انتشار 2009